Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

作战体系有序性判别模型*

未来作战已经逐步演变为体系之间的对抗,为确保我军作战体系有序进行发挥其作战力量,探讨了作战体系有序性问题;应用了耗散结构理论和灰色系统理论,把灰关联度与熵结合起来,以序参量为基础,建立了基于灰关联熵的作战体系有序性判别模型.研究结果为对作战体系实施调控提供了依据,使作战体系符合现代战场态势发展的需要.     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

See the light: Optimization of put-to-light order picking systems

Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems.     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

化学危险品事故处置的程序与技术要点

根据化学危险品事故的特点及消防部队的装备配备情况 ,提出了一整套化学危险品事故抢险救援的程序 ,并介绍了处置过程中的关键技术。     

信号相位匹配法检测正弦信号的高阶统计量方法

为了能对提高高斯色噪声中正弦信号的检测能力,提出了二阶自相关和四阶累积量预处理的信号相位匹配检测法.仿真结果表明,高斯色噪声中四阶累积量预处理的信号相位匹配检测法的检测性能接近于高斯白噪声下匹配滤波器,优于二阶自相关的信号相位匹配检测法的检测性能,更优于的信号相位匹配的最小二乘检测器.     

面向能力需求的武器装备组合规划模型与算法

针对武器装备组合规划中存在的选择难、规划难问题,在给定能力需求的条件下,从分析装备的组合变更对整体体系的影响出发,考虑了总的经费预算、年度费用分配、装备规划周期等约束,以能力差距和发展风险最小为准则,构建了双目标优化模型,并设计了基于差分进化和非支配排序的遗传算法的求解算法,获得模型的Pareto解。通过逼近理想解排序法方法从所求Pareto解中求得令决策者满意的折中解。通过一个具体示例验证了模型和算法的有效性,能够为武器装备组合规划提供辅助决策。     

Reliability and mean residual life functions of coherent systems in an active redundancy

In this article, the reliability and the mean residual life (MRL) functions of a system with active redundancies at the component and system levels are investigated. In active redundancy at the component level, the original and redundant components are working together and lifetime of the system is determined by the maximum of lifetime of the original components and their spares. In the active redundancy at the system level, the system has a spare, and the original and redundant systems work together. The lifetime of such a system is then the maximum of lifetimes of the system and its spare. The lifetimes of the original component and the spare are assumed to be dependent random variables. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 19–28, 2017     

基于高阶滑模微分器的增广比例导引律

导引律的设计在导弹制导与控制中具有重要作用,为了解决增广比例导引中导弹-目标视线角速度和视线角加速度不易获得的问题,设计了一种基于高阶滑模微分器的增广比例导引律。首先,根据高阶滑模微分器的数学模型建立视线角速度和视线角加速度的估计模型;其次,根据视线角速度和视线角加速度的估计值,利用一种光滑无抖阵滑模微分器构造增广比例导引律。最后,通过仿真验证表明,具有滑模微分器结构的增广比例导引律导引性能良好。